| 翻訳と辞書 |
| Kneser graphs ： ウィキペディア英語版 |
Kneser graph
In graph theory, the Kneser graph is the graph whose vertices correspond to the , and where two vertices are adjacent if and only if the two corresponding sets are disjoint. Kneser graphs are named after Martin Kneser, who first investigated them in 1955.
== Examples ==
The complete graph on vertices is the Kneser graph .
The complement of the line graph of the complete graph on vertices is the Kneser graph .
The Kneser graph is known as the odd graph ; the odd graph is isomorphic to the Petersen graph.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Kneser graph」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|